翻訳と辞書 Words near each other ・ Maximum power point tracking ・ Maximum Power Point Tracking Using novel Bisection search Algorithm ・ Maximum power principle ・ Maximum power transfer theorem ・ Maximum Priest E.P. ・ Maximum principle ・ Maximum Pro Wrestling ・ Maximum programme ・ Maximum ramp weight ・ Maximum Residue Limit ・ Maximum retail price ・ Maximum Ride ・ Maximum Risk ・ Maximum Rocknroll (album) ・ Maximum safe storage temperature ・ Maximum satisfiability problem ・ Maximum score estimator ・ Maximum Security ・ Maximum Security (Alien Sex Fiend album) ・ Maximum Security (comics) ・ Maximum Security (novel) ・ Maximum Security (Tony MacAlpine album) ・ Maximum Security (TV series) ・ Maximum security prison ・ Maximum segment lifetime ・ Maximum segment size ・ Maximum Shame ・ Maximum spacing estimation ・ Maximum Strength ・ Maximum subarray problem Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Maximum satisfiability problem ： ウィキペディア英語版 Maximum satisfiability problem In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula. It is a generalization of the Boolean satisfiability problem, which asks whether there exists a truth assignment that makes all clauses true. ==Example== The conjunctive normal form formula :$(x\_0\backslash lor\; x\_1)\backslash land(x\_0\backslash lor\backslash lnot\; x\_1)\backslash land(\backslash lnot\; x\_0\backslash lor\; x\_1)\backslash land(\backslash lnot\; x\_0\backslash lor\backslash lnot\; x\_1)$ is not satisfiable: no matter which truth values are assigned to its two variables, at least one of its four clauses will be false. However, it is possible to assign truth values in such a way as to make three out of four clauses true; indeed, every truth assignment will do this. Therefore, if this formula is given as an instance of the MAX-SAT problem, the solution to the problem is the number three. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Maximum satisfiability problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.